PDE-constrained models with neural network terms: Optimization and global convergence

نویسندگان

چکیده

Recent research has used deep learning to develop partial differential equation (PDE) models in science and engineering. The functional form of the PDE is determined by a neural network, network parameters are calibrated available data. Calibration embedded can be performed optimizing over PDE. Motivated these applications, we rigorously study optimization class linear elliptic PDEs with terms. optimized using gradient descent, where evaluated an adjoint As number become large, converge non-local system. Using this limit system, able prove convergence network-PDE global minimum during optimization. Finally, use method train model for application fluid mechanics, which functions as closure Reynolds-averaged Navier–Stokes (RANS) equations. RANS trained on several datasets turbulent channel flow out-of-sample at different Reynolds numbers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization

In this paper, we present constrained simulated annealing (CSA), a global minimization algorithm that converges to constrained global minima with probability one, for solving nonlinear discrete nonconvex constrained minimization problems. The algorithm is based on the necessary and sufficient condition for constrained local minima in the theory of discrete Lagrange multipliers we developed earl...

متن کامل

A PDE-Constrained Optimization Formulation for Discrete Fracture Network Flows

We investigate a new numerical approach for the computation of the threedimensional flow in a discrete fracture network that does not require a conforming discretization of partial differential equations on complex three-dimensional systems of planar fractures. The discretization within each fracture is performed independently of the discretization of the other fractures and of their intersecti...

متن کامل

Algorithms for PDE-Constrained Optimization

In this paper we review a number of algorithmic approaches for solving optimization problems with PDE constraints. Most of these methods were originally developed for finite dimensional problems. When applied to optimization problems with PDE constraints, new aspects become important. For instance, (discretized) PDE-constrained problems are inherently large-scale. Some aspects, like mesh indepe...

متن کامل

Global Convergence of Delayed Neural Network Systems

In this paper, without assuming the boundedness, strict monotonicity and differentiability of the activation functions, we utilize a new Lyapunov function to analyze the global convergence of a class of neural networks models with time delays. A new sufficient condition guaranteeing the existence, uniqueness and global exponential stability of the equilibrium point is derived. This stability cr...

متن کامل

PDE-constrained optimization with error estimation and control

This paper describes an algorithm for PDE-constrained optimization that controls numerical errors using error estimates and grid adaptation. A key aspect of the algorithm is the use of adjoint variables to estimate errors in the first-order optimality conditions. Multilevel optimization is used to drive the optimality conditions and their estimated errors below a specified tolerance. The error ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2023

ISSN: ['1090-2716', '0021-9991']

DOI: https://doi.org/10.1016/j.jcp.2023.112016